Dichotomy of the H-Quasi-Cover Problem
نویسندگان
چکیده
We show that the problem whether a given simple graph G admits a quasi-covering to a fixed connected graph H is solvable in polynomial time if H has at most two vertices and that it is NP-complete otherwise. As a byproduct we show constructions of regular quasi-covers and of multi-quasi-covers that might be of independent interest.
منابع مشابه
Induced minors and well-quasi-ordering
A graph H is an induced minor of a graph G if it can be obtained from an induced subgraph of G by contracting edges. Otherwise, G is said to be H-induced minor-free. Robin Thomas showed that K4-induced minor-free graphs are well-quasi-ordered by induced minors [Graphs without K4 and well-quasi-ordering, Journal of Combinatorial Theory, Series B, 38(3):240 – 247, 1985]. We provide a dichotomy th...
متن کاملWell-quasi-ordering H-contraction-free graphs
A well-quasi-order is an order which contains no infinite decreasing sequence and no infinite collection of incomparable elements. In this paper, we consider graph classes defined by excluding one graph as contraction. More precisely, we give a complete characterization of graphs H such that the class of H-contraction-free graphs is well-quasi-ordered by the contraction relation. This result is...
متن کاملMinimum Cost Homomorphisms to Locally Semicomplete and Quasi-Transitive Digraphs
For digraphs G and H , a homomorphism of G to H is a mapping f : V (G)→V (H) such that uv ∈ A(G) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (G) is associated with costs ci(u), i ∈ V (H), then the cost of a homomorphism f is ∑ u∈V (G) cf(u)(u). For each fixed digraph H , the minimum cost homomorphism problem for H , denoted MinHOM(H), can be formulated as follows: Given an input di...
متن کاملMinimum cost homomorphisms to locally semicomplete digraphs and quasi-transitive digraphs
For digraphs G and H, a homomorphism of G to H is a mapping f : V (G)→V (H) such that uv ∈ A(G) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (G) is associated with costs ci(u), i ∈ V (H), then the cost of a homomorphism f is ∑ u∈V (G) cf(u)(u). For each fixed digraph H, the minimum cost homomorphism problem for H, denoted MinHOM(H), can be formulated as follows: Given an input digra...
متن کاملQuasi-Static Numerical Simulation of Missile Staging
In this study, the missile staging process by implementing a side-injected jet is simulated numerically. The problem is considered to be axisymmetric and the thin shear layer approximation of Navier-Stokes equations along with an algebraic turbulence model is used in a quasi-static form for the calculations. The free stream corresponds to a very high altitude flight condition with a Mach number...
متن کامل